Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
h(f(f(x))) |
→ h(f(g(f(x)))) |
| 2: |
|
f(g(f(x))) |
→ f(f(x)) |
|
There are 3 dependency pairs:
|
| 3: |
|
H(f(f(x))) |
→ H(f(g(f(x)))) |
| 4: |
|
H(f(f(x))) |
→ F(g(f(x))) |
| 5: |
|
F(g(f(x))) |
→ F(f(x)) |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The usable rules are {2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006